Estimating the Margin of Victory for Instant-Runoff Voting
نویسنده
چکیده
A general definition is proposed for the margin of victory of an election contest. That definition is applied to Instant Runoff Voting (IRV)1 and several estimates for the IRV margin of victory are described: two upper bounds and two lower bounds. Given round-by-round vote totals, the time complexity for calculating these bounds does not exceed O(C logC), where C is the number of candidates. It is also shown that calculating the larger and more useful of the two lower bounds can be viewed, in part, as solving a longest path problem on a weighted, directed, acyclic graph. Worst-case analysis shows that neither these estimates, nor any estimates based only on tabulation round-byround vote totals, are guaranteed to be within a constant factor of the margin of victory. These estimates are calculated for IRV elections in Australia and California. Pseudo code for calculating these estimates is provided.
منابع مشابه
Computing the Margin of Victory in IRV Elections
Efficient post-election audits select the number of machines or precincts to audit based in part on the margin of victory (the number of ballots that must be changed in order to change the outcome); a close election needs more auditing than a landslide victory. For a simple “first-pastthe-post” election, the margin is easily computed based on the number of votes the first and second place candi...
متن کاملEfficient Computation of Exact IRV Margins
The margin of victory is easy to compute for many election schemes but difficult for Instant Runoff Voting (IRV). This is important because arguments about the correctness of an election outcome usually rely on the size of the electoral margin. For example, risk-limiting audits require a knowledge of the margin of victory in order to determine how much auditing is necessary. This paper presents...
متن کاملEstimating the Margin of Victory of an Election Using Sampling
The margin of victory of an election is a useful measure to capture the robustness of an election outcome. It also plays a crucial role in determining the sample size of various algorithms in post election audit, polling etc. In this work, we present efficient sampling based algorithms for estimating the margin of victory of elections. More formally, we introduce the (c, ε, δ)–MARGIN OF VICTORY...
متن کاملRisk-limiting Audits for Nonplurality Elections
Many organizations have turned to alternative voting systems such as instant-runoff voting for determining the outcome of single-winner elections. It is our position in this paper that the increasing deployment of such alternative systems necessitate the study and development of risklimiting audits for these systems. We initiate this study. We examine several commonly used single-winner voting ...
متن کاملSample Complexity for Winner Prediction in Elections
Predicting the winner of an election is a favorite problem both for news media pundits and computational social choice theorists. Since it is often infeasible to elicit the preferences of all the voters in a typical prediction scenario, a common algorithm used for winner prediction is to run the election on a small sample of randomly chosen votes and output the winner as the prediction. We anal...
متن کامل